Reconstructing $f(R)$ gravity from the spectral index
نویسندگان
چکیده
منابع مشابه
Reconstructing the f(R) gravity from the holographic principle
An holographic f(R) gravity model of dark energy is proposed. The correspondence between the f(R) geometrical effective energy density with the holographic density, allows the reconstruction of the f(R) gravity in flat FRW background in the Einstein frame. The proposed infrared cut-off for the holographic energy density depends on two parameters which are fit using the luminosity versus redshif...
متن کاملSpectral energy distributions of FR I nuclei and the FR I / BL Lac unifying model
We consider archival ROSAT and Hubble Space Telescope (HST) observations of five FR I radio galaxies and isolate their nuclear emission from that of the host galaxy. This enable us to determine the Spectral Energy Distributions (SED) of their nuclei spanning from the radio to the X–ray band. They cannot be described as single power–laws but require the presence of an emission peak located betwe...
متن کاملReconstructing Galaxy Spectral Energy Distributions from Broadband Photometry
We present a novel approach to photometric redshifts, one that merges the advantages of both the template fitting and empirical fitting algorithms, without any of their disadvantages. This technique derives a set of templates, describing the spectral energy distributions of galaxies, from a catalog with both multicolor photometry and spectroscopic redshifts. The algorithm is essentially using t...
متن کاملRunning spectral index from shooting-star moduli
We construct an inflationary model that is consistent with both large nonGaussianity and a running spectral index. The scenario of modulated inflation suggests that modulated perturbation can induce the curvature perturbation with a large non-Gaussianity, even if the inflaton perturbation is negligible. Using this idea, we consider a multi-field extension of the modulated inflation scenario and...
متن کاملReconstructing Many Partitions Using Spectral Techniques
A partitioning of a set of n items is a grouping of these items into k disjoint, equally sized classes. Any partition can be modeled as a graph. The items become the vertices of the graph and two vertices are connected by an edge if and only if the associated items belong to the same class. In a planted partition model a graph that models a partition is given, which is obscured by random noise,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Progress of Theoretical and Experimental Physics
سال: 2018
ISSN: 2050-3911
DOI: 10.1093/ptep/pty111